<html>
 <head>
  <link href="./leetcode-problem.css" rel="stylesheet" type="text/css">
 </head>
 <body>
  <div class="question_difficulty">
   难度：Hard
  </div>
  <div>
   <h1 class="question_title">
    23. Merge k Sorted Lists
   </h1>
   <p>
    Merge
    <em>
     k
    </em>
    sorted linked lists and return it as one sorted list. Analyze and describe its complexity.
   </p>
   <p>
    <strong>
     Example:
    </strong>
   </p>
   <pre>
<strong>Input:</strong>
[
&nbsp; 1-&gt;4-&gt;5,
&nbsp; 1-&gt;3-&gt;4,
&nbsp; 2-&gt;6
]
<strong>Output:</strong> 1-&gt;1-&gt;2-&gt;3-&gt;4-&gt;4-&gt;5-&gt;6
</pre>
  </div>
  <div>
   <h1 class="question_title">
    23. 合并K个排序链表
   </h1>
   <p>
    合并&nbsp;
    <em>
     k&nbsp;
    </em>
    个排序链表，返回合并后的排序链表。请分析和描述算法的复杂度。
   </p>
   <p>
    <strong>
     示例:
    </strong>
   </p>
   <pre><strong>输入:</strong>
[
&nbsp; 1-&gt;4-&gt;5,
&nbsp; 1-&gt;3-&gt;4,
&nbsp; 2-&gt;6
]
<strong>输出:</strong> 1-&gt;1-&gt;2-&gt;3-&gt;4-&gt;4-&gt;5-&gt;6</pre>
  </div>
 </body>
</html>